Data-Driven Fault Supervisory Control Theory and Applications
نویسندگان
چکیده
منابع مشابه
Time Driven Activity Based Costing : Theory,Applications and Limitations
The aim of this study is to explore the strategic applications and limitations of Time-driven Activity-based Costing (TDABC) and to evaluate the degree of accuracy of the proponents’ arguments concerning its usefulness. In this study, published works directly related to this area from the period 2004-2015 are analyzed. This study reports TDABC's applications in strategic areas such as cost of p...
متن کاملMechatronic Design and Supervisory Control Theory for Fluid Power Applications
The aim of this work is to integrate the use of formal tools for analysis, control and synthesis of systems in mechatronic design. Besides, the work presents an integrated design approach for fluid power systems, in which the control system is conceived during the design process of the physical plant, making the global design more efficient and reliable.
متن کاملSampled-data supervisory control
This paper focuses on issues related to implementing timed discrete-event systems (TDES) supervisors, and the concurrency and timing delay issues involved. In particular, we examine issues related to implementing TDES as sampled-data (SD) controllers. An SD controller is driven by a periodic clock and sees the system as a series of inputs and outputs. On each clock edge (tick event), it samples...
متن کاملEnhanced distinguishability in Supervisory Fault Tolerant Control
This paper deals with the design of an estimator-based supervisory Fault Tolerant Control (FTC) scheme for Linear Time Invariant (LTI) systems. A formal stability proof based on dwell-time conditions is presented when the state of the detection filter does not correspond to the plant state, as in classical (Luenberger) observer-based approaches. In this context, fault isolability could be impro...
متن کاملPerformance in Supervisory Control Theory
A supervisor is generated with Supervisory Control Theory [3], resulting in a nonblocking and minimally restrictive controller. Time is introduced time using timed automata theory. A compact data structure is used to keep track of the time information in the timed automata: Heaps of Pieces [2]. The fastest sequence of events is found, using graph search algorithms of Dijkstra and A [1]. This is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/387341